n = int(input())
a = list(map(int, input().split()))
b = input()
minl = int(-1e9)
maxr = int(1e9)
for i in range(4, n):
if not (b[i-4] == b[i-3] == b[i-2] == b[i-1] != b[i]):
continue
if b[i] == '0':
maxr = min(maxr+1, a[i], a[i-1], a[i-2], a[i-3], a[i-4])-1
if b[i] == '1':
minl = max(minl-1, a[i], a[i-1], a[i-2], a[i-3], a[i-4])+1
print(minl, maxr)
896A - Nephren gives a riddle | 761A - Dasha and Stairs |
1728B - Best Permutation | 1728A - Colored Balls Revisited |
276B - Little Girl and Game | 1181A - Chunga-Changa |
1728C - Digital Logarithm | 1728D - Letter Picking |
792B - Counting-out Rhyme | 1195A - Drinks Choosing |
5D - Follow Traffic Rules | 1272A - Three Friends |
1632D - New Year Concert | 1400D - Zigzags |
716C - Plus and Square Root | 412A - Poster |
844B - Rectangles | 1591A - Life of a Flower |
1398C - Good Subarrays | 629A - Far Relative’s Birthday Cake |
1166A - Silent Classroom | 1000B - Light It Up |
218B - Airport | 1463B - Find The Array |
1538C - Number of Pairs | 621B - Wet Shark and Bishops |
476B - Dreamoon and WiFi | 152C - Pocket Book |
1681D - Required Length | 1725D - Deducing Sortability |